Coloring (P5,gem) $({P}_{5},\text{gem})$‐free graphs with Δ−1 ${\rm{\Delta }}-1$ colors
نویسندگان
چکیده
The Borodin–Kostochka Conjecture states that for a graph G $G$ , if Δ ( ) ≥ 9 ${\rm{\Delta }}(G)\ge 9$ and ω ≤ − 1 $\omega (G)\le {\rm{\Delta }}(G)-1$ then χ $\chi . We prove the P 5 gem $({P}_{5},\text{gem})$ -free graphs, is, graphs with no induced ${P}_{5}$ K ∨ 4 ${K}_{1}\vee {P}_{4}$
منابع مشابه
Coloring claw-free graphs with ∆− 1 colors
We prove that every claw-free graph G that does not contain a clique on ∆(G) ≥ 9 vertices can be ∆(G)− 1 colored.
متن کاملColoring 3-colorable graphs with o(n^{1/5}) colors
Recognizing 3-colorable graphs is one of the most famous NP-complete problems [Garey, Johnson, and Stockmeyer STOC’74]. The problem of coloring 3-colorable graphs in polynomial time with as few colors as possible has been intensively studied: O(n1/2) colors [Wigderson STOC’82], Õ(n2/5) colors [Blum STOC’89], Õ(n3/8) colors [Blum FOCS’90], O(n1/4) colors [Karger, Motwani, Sudan FOCS’94], Õ(n3/14...
متن کاملList-Coloring Claw-Free Graphs with Δ-1 Colors
We prove that if G is a quasi-line graph with ∆(G) > ω(G) and ∆(G) ≥ 69, then χOL(G) ≤ ∆(G) − 1. Together with our previous work, this implies that if G is a claw-free graph with ∆(G) > ω(G) and ∆(G) ≥ 69, then χl(G) ≤ ∆(G)− 1.
متن کاملColoring graphs with locally few colors
Assume that a graph G has a good-coloring which uses at most r colors in the neighborhood of every vertex. We call this kind of coloring a local r-coloring . Is it true that the chromatic number of G is bounded? For r = 1 the answer is easy, G is bipartite, as it cannot have an odd circuit . For r = 2, however, the situation is completely different. A graph can be given with arbitrarily large (...
متن کاملDistributed coloring in sparse graphs with fewer colors
This paper is concerned with efficiently coloring sparse graphs in the distributed setting with as few colors as possible. According to the celebrated Four Color Theorem, planar graphs can be colored with at most 4 colors, and the proof gives a (sequential) quadratic algorithm finding such a coloring. A natural problem is to improve this complexity in the distributed setting. Using the fact tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2022
ISSN: ['0364-9024', '1097-0118']
DOI: https://doi.org/10.1002/jgt.22845